Excluded unless essential

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unless reasoning.

We report the results of two experiments investigating conditional inferences from conditional unless assertions, such as Juan is not in León unless Nuria is in Madrid. Experiments 1 and 2 check Fillenbaum's hypothesis about the semantic similarity of unless with if not and only if assertions; both also examine inferential endorsements (Experiment 1) and endorsements and latencies (Experiment 2...

متن کامل

Domination, Packing and Excluded Minors

Let γ(G) be the domination number of a graph G, and let αk(G) be the maximum number of vertices in G, no two of which are at distance ≤ k in G. It is easy to see that γ(G) ≥ α2(G). In this note it is proved that γ(G) is bounded from above by a linear function in α2(G) if G has no large complete bipartite graph minors. Extensions to other parameters αk(G) are also derived.

متن کامل

Measurable sets with excluded distances

For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially small in k provided the ratios d1/d2, d2/d3, . . . , dk−1/dk are all small enough. This resolves a question of Székely, and generalizes a theorem of Furstenberg-Katznelson-Weiss, Falconer-Marstrand, and Bourgain. Several ...

متن کامل

Distributed Testing of Excluded Subgraphs

We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H , testing whether a graph is H-free can be done in a constant...

متن کامل

Building Blocks and Excluded Sums

Figure 3. The four terms PPij, PSij, SPij, and SSij “wrap around” the excluded center cell i,j to cover the shaded region. Figure 2. The prefix algorithm. The prefix and suffix sums Pi ,Si are computed as cumulative sums starting from the left and from the right. The excluded sum is then Pi–1 + Si+1. If we peel away, layer by layer, the complexities of the fast multipole method, we find that it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Orthodontics and Dentofacial Orthopedics

سال: 2018

ISSN: 0889-5406

DOI: 10.1016/j.ajodo.2018.07.002